A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
نویسندگان
چکیده
We propose a relaxation scheme for mathematical programs with equilibrium constraints (MPECs). In contrast to previous approaches, our relaxation is two-sided: both the complementarity and the nonnegativity constraints are relaxed. The proposed relaxation update rule guarantees (under certain conditions) that the sequence of relaxed subproblems will maintain a strictly feasible interior—even in the limit. We show how the relaxation scheme can be used in combination with a standard interior-point method to achieve superlinear convergence. Numerical results on the MacMPEC test problem set demonstrate the fast local convergence properties of the approach.
منابع مشابه
A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
We present a new relaxation scheme for mathematical programs with equilibrium constraints (MPEC), where the complementarity constraints are replaced by a reformulation that is exact for the complementarity conditions corresponding to sufficiently non-degenerate complementarity components and relaxes only the remaining complementarity conditions. A positive parameter determines to what extent th...
متن کاملConvergence Properties of the Inexact Lin-fukushima Relaxation Method for Mathematical Programs with Equilibrium Constraints
Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set of MPECs is described by standard equality and inequality constraints as well as additional complementarity constraints that are used to model equilibrium conditions in different applications. But these complementarity constraints imply that...
متن کاملA branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
We present a branch-and-bound algorithm for discretely-constrained mathematical programs with equilibrium constraints (DC-MPEC). This is a class of bilevel programs with an integer program in the upper-level and a complementarity problem in the lower-level. The algorithm builds on the work by Gabriel et al. (2010) and uses Benders decomposition to form a master problem and a subproblem. The new...
متن کاملThe Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Equilibrium Constraints Revisited
Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set has a very special structure and violates most of the standard constraint qualifications. Therefore, one typically applies specialized algorithms in order to solve MPECs. One prominent class of specialized algorithms are the relaxation (or r...
متن کاملA Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints: Erratum
In [1], a modified relaxation method was proposed for mathematical programs with complementarity constraints and some new sufficient conditions for Mor B-stationarity were shown. However, due to an ignored sign in the Lagrangian function of the relaxed problem, the proofs of Theorems 3.4 and 3.5 in [1] are incorrect. In what follows, we give the corrected proofs. Throughout, we use the same not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 16 شماره
صفحات -
تاریخ انتشار 2005